Min-max vs. max-min flow control algorithms for optimal computer network capacity assignment
نویسندگان
چکیده
منابع مشابه
Quantum Max-flow/Min-cut
The classical max-flow min-cut theorem describes transport through certain idealized classical networks. We consider the quantum analog for tensor networks. Although some aspects generalize , surprising counterexamples are found. We speculate that the phenomena revealed may be of interest in both spin systems in condensed matter and in quantum gravity.
متن کاملApproximation Algorithms for Min-Max Tree Partition
We consider the problem of partitioning the node set of a graph into p equal sized subsets. The objective is to minimize the maximum length, over these subsets, of a minimum spanning tree. We show that no polynomial algorithm with bounded Ž 2 . error ratio can be given for the problem unless P s NP. We present an O n time algorithm for the problem, where n is the number of nodes in the graph. A...
متن کاملApproximation algorithms for MAX-MIN tiling
The MAX-MIN tiling problem is as follows. We are given A[1, . . . , n][1, . . . , n], a two-dimensional array where each entry A[i][j ] stores a non-negative number. Define a tile of A to be a subarray A[ , . . . , r][t, . . . , b] of A, the weight of a tile to be the sum of all array entries in it, and a tiling of A to be a collection of tiles of A such that each entry A[i][j ] is contained in...
متن کاملComplexity of the min-max and min-max regret assignment problems
This paper investigates the complexity of the min-max and min-max regret assignment problems both in the discrete scenario and interval data cases. We show that these problems are strongly NP -hard for an unbounded number of scenarios. We also show that the interval data min-max regret assignment problem is strongly NP -hard.
متن کاملAgglomerative Learning Algorithms for General Fuzzy Min-Max Neural Network
In this paper two agglomerative learning algorithms based on new similarity measures defined for hyperbox fuzzy sets are proposed. They are presented in a context of clustering and classification problems tackled using a general fuzzy min-max (GFMM) neural network. The proposed agglomerative schemes have shown robust behaviour in presence of noise and outliers and insensitivity to the order of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 1984
ISSN: 0377-0427
DOI: 10.1016/0377-0427(84)90021-9